Unsupervised Change Detection in Hyperspectral Images using Principal Components Space Data Clustering

Change detection of hyperspectral images is a very important subject in the field of remote sensing application. Due to the large number of bands and the high correlation between adjacent bands in the hyperspectral image cube, information redundancy is a big problem, which increases the computational complexity and brings negative factor to detection performance. To address this problem, the principal component analysis (PCA) has been widely used for dimension reduction. It has the capability of projecting the original multi-dimensional hyperspectral data into new eigenvector space which allows it to extract light but representative information. The difference image of the PCA components is obtained by subtracting the two dimensionality-reduced images, on which the change detection is considered as a binary classification problem. The first several principal components of each pixel are taken as a feature vector for data classification using k-means clustering with k=2, where the two classes are changed pixels and unchanged pixels, respectively. The centroids of two clusters are determined by iteratively finding the minimum Euclidean distance between pixel's eigenvectors. Experiments on two publicly available datasets have been carried out and evaluated by overall accuracy. The results have validated the efficacy and efficiency of the proposed approach.</p

PSSA: PCA-domain superpixelwise singular spectral analysis for unsupervised hyperspectral image classification.

Although supervised classification of hyperspectral images (HSI) has achieved success in remote sensing, its applications in real scenarios are often constrained, mainly due to the insufficiently available or lack of labelled data. As a result, unsupervised HSI classification based on data clustering is highly desired, yet it generally suffers from high computational cost and low classification accuracy, especially in large datasets. To tackle these challenges, a novel unsupervised spatial-spectral HSI classification method is proposed. By combining the entropy rate superpixel segmentation (ERS), superpixel-based principal component analysis (PCA), and PCA-domain 2D singular spectral analysis (SSA), both the efficacy and efficiency of feature extraction are improved, followed by the anchor-based graph clustering (AGC) for effective classification. Experiments on three publicly available and five self-collected aerial HSI datasets have fully demonstrated the efficacy of the proposed PCA-domain superpixelwise SSA (PSSA) method, with a gain of 15–20% in terms of the overall accuracy, in comparison to a few state-of-the-art methods. In addition, as an extra outcome, the HSI dataset we acquired is provided freely online

PCA-Domain Fused Singular Spectral Analysis for Fast and Noise-Robust Spectral-Spatial Feature Mining in Hyperspectral Classification

The principal component analysis (PCA) and 2-D singular spectral analysis (2DSSA) are widely used for spectral- and spatial-domain feature extraction in hyperspectral images (HSIs). However, PCA itself suffers from low efficacy if no spatial information is combined, while 2DSSA can extract the spatial information yet has a high computing complexity. As a result, we propose in this letter a PCA domain 2DSSA approach for spectral-spatial feature mining in HSI. Specifically, PCA and its variation, folded PCA (FPCA) are fused with the 2DSSA, as FPCA can extract both global and local spectral features. By applying 2DSSA only on a small number of PCA components, the overall computational cost can be significantly reduced while preserving the discrimination ability of the features. In addition, with the effective fusion of spectral and spatial features, our approach can work well on the uncorrected dataset without removing the noisy and water absorption bands, even under a small number of training samples. Experiments on two publicly available datasets have fully validated the superiority of the proposed approach, in comparison to several state-of-the-art methods and deep learning models.</p

EACOFT: an energy-aware correlation filter for visual tracking.

Correlation filter based trackers attribute to its calculation in the frequency domain can efficiently locate targets in a relatively fast speed. This characteristic however also limits its generalization in some specific scenarios. The reasons that they still fail to achieve superior performance to state-of-the-art (SOTA) trackers are possibly due to two main aspects. The first is that while tracking the objects whose energy is lower than the background, the tracker may occur drift or even lose the target. The second is that the biased samples may be inevitably selected for model training, which can easily lead to inaccurate tracking. To tackle these shortcomings, a novel energy-aware correlation filter (EACOFT) based tracking method is proposed, in our approach the energy between the foreground and the background is adaptively balanced, which enables the target of interest always having a higher energy than its background. The samples’ qualities are also evaluated in real time, which ensures that the samples used for template training are always helpful with tracking. In addition, we also propose an optimal bottom-up and top-down combined strategy for template training, which plays an important role in improving both the effectiveness and robustness of tracking. As a result, our approach achieves a great improvement on the basis of the baseline tracker, especially under the background clutter and fast motion challenges. Extensive experiments over multiple tracking benchmarks demonstrate the superior performance of our proposed methodology in comparison to a number of the SOTA trackers

CBANet: an end-to-end cross band 2-D attention network for hyperspectral change detection in remote sensing.

As a fundamental task in remote sensing observation of the earth, change detection using hyperspectral images (HSI) features high accuracy due to the combination of the rich spectral and spatial information, especially for identifying land-cover variations in bi-temporal HSIs. Relying on the image difference, existing HSI change detection methods fail to preserve the spectral characteristics and suffer from high data dimensionality, making them extremely challenging to deal with changing areas of various sizes. To tackle these challenges, we propose a cross-band 2-D self-attention Network (CBANet) for end-to-end HSI change detection. By embedding a cross-band feature extraction module into a 2-D spatial-spectral self-attention module, CBANet is highly capable of extracting the spectral difference of matching pixels by considering the correlation between adjacent pixels. The CBANet has shown three key advantages: 1) less parameters and high efficiency; 2) high efficacy of extracting representative spectral information from bi-temporal images; and 3) high stability and accuracy for identifying both sparse sporadic changing pixels and large changing areas whilst preserving the edges. Comprehensive experiments on three publicly available datasets have fully validated the efficacy and efficiency of the proposed methodology

Fusion of infrared and visible images for remote detection of low-altitude slow-speed small targets.

Detection of the low-altitude and slow-speed small (LSS) targets is one of the most popular research topics in remote sensing. Despite of a few existing approaches, there is still an accuracy gap for satisfying the practical needs. As the LSS targets are too small to extract useful features, deep learning based algorithms can hardly be used. To this end, we propose in this article an effective strategy for determining the region of interest, using a multiscale layered image fusion method to extract the most representative information for LSS-target detection. In addition, an improved self-balanced sensitivity segment model is proposed to detect the fused LSS target, which can further improve both the detection accuracy and the computational efficiency. We conduct extensive ablation studies to validate the efficacy of the proposed LSS-target detection method on three public datasets and three self-collected datasets. The superior performance over the state of the arts has fully demonstrated the efficacy of the proposed approach

Magnesium-Rich Calcium Phosphate Derived from Tilapia Bone Has Superior Osteogenic Potential

We extracted magnesium-rich calcium phosphate bioceramics from tilapia bone using a gradient thermal treatment approach and investigated their chemical and physicochemical properties. X-ray diffraction showed that tilapia fish bone-derived hydroxyapatite (FHA) was generated through the first stage of thermal processing at 600–800 °C. Using FHA as a precursor, fish bone biphasic calcium phosphate (FBCP) was produced after the second stage of thermal processing at 900–1200 °C. The beta-tricalcium phosphate content in the FBCP increased with an increasing calcination temperature. The fact that the lattice spacing of the FHA and FBCP was smaller than that of commercial hydroxyapatite (CHA) suggests that Mg-substituted calcium phosphate was produced via the gradient thermal treatment. Both the FHA and FBCP contained considerable quantities of magnesium, with the FHA having a higher concentration. In addition, the FHA and FBCP, particularly the FBCP, degraded faster than the CHA. After one day of degradation, both the FHA and FBCP released Mg2+, with cumulative amounts of 4.38 mg/L and 0.58 mg/L, respectively. Furthermore, the FHA and FBCP demonstrated superior bone-like apatite formation; they are non-toxic and exhibit better osteoconductive activity than the CHA. In light of our findings, bioceramics originating from tilapia bone appear to be promising in biomedical applications such as fabricating tissue engineering scaffolds

Big Data Analytics and Mining for Effective Visualization and Trends Forecasting of Crime Data

Big data analytics (BDA) is a systematic approach for analyzing and identifying different patterns, relations, and trends within a large volume of data. In this paper, we apply BDA to criminal data where exploratory data analysis is conducted for visualization and trends prediction. Several the state-of-the-art data mining and deep learning techniques are used. Following statistical analysis and visualization, some interesting facts and patterns are discovered from criminal data in San Francisco, Chicago, and Philadelphia. The predictive results show that the Prophet model and Keras stateful LSTM perform better than neural network models, where the optimal size of the training data is found to be three years. These promising outcomes will benefit for police departments and law enforcement organizations to better understand crime issues and provide insights that will enable them to track activities, predict the likelihood of incidents, effectively deploy resources and optimize the decision making process

Decontaminate feature for tracking : adaptive tracking via evolutionary feature subset

Although various visual tracking algorithms have been proposed in the last 2-3 decades, it remains a challenging problem for effective tracking with fast motion, deformation, occlusion et al. Under complex tracking conditions, most tracking models are not discriminative and adaptive enough. When the combined feature vectors are inputted to the visual models, this may lead to redundancy caused low efficiency and ambiguity caused poor performance. In this paper, an effective tracking algorithm is proposed to decontaminate features for each video sequence adaptively, where the visual modeling is treated as an optimization problem from the perspective of evolution. Every feature vector is compared to a biological individual and then decontaminated via classical evolutionary algorithms. With the optimized subsets of features, “Curse of Dimensionality” has been avoided whilst the accuracy of the visual model has been improved. The proposed algorithm has been tested on several publicly available datasets with various tracking challenges and benchmarked with a number of state-of-the-art approaches. The comprehensive experiments have demonstrated the efficacy of the proposed methodology

Optimal Appearance Model for Visual Tracking.

Many studies argue that integrating multiple cues in an adaptive way increases tracking performance. However, what is the definition of adaptiveness and how to realize it remains an open issue. On the premise that the model with optimal discriminative ability is also optimal for tracking the target, this work realizes adaptiveness and robustness through the optimization of multi-cue integration models. Specifically, based on prior knowledge and current observation, a set of discrete samples are generated to approximate the foreground and background distribution. With the goal of optimizing the classification margin, an objective function is defined, and the appearance model is optimized by introducing optimization algorithms. The proposed optimized appearance model framework is embedded into a particle filter for a field test, and it is demonstrated to be robust against various kinds of complex tracking conditions. This model is general and can be easily extended to other parameterized multi-cue models